A well-shuffled deck

How, when and how much a card deck is well shuffled?

The thesis consider the mixing of few (3-4) card shuffling as well as of large (52 card) deck. The thesis is showing the limit on the shuffling to homogeneity elaborated in short program; the thesis is in italian.

A Modified Shuffled-frog-leaping Algorithm for Optimizing Bridge-deck Repairs

Infrastructure assessment and renewal have been in the center of attention worldwide. While the infrastructure is the foundation for economic growth, a large percentage of existing facilities are rapidly deteriorating due to age, outdated technology, and insufficient capacity for population growth. Prioritizing infrastructure facilities for repair purposes, the allocation of the limited funds, ...

Mapped Shuffled Fibonacci Languages

The purpose of this paper is to study properties of mapped shuffled Fibonacci languages F(afi) and F^vy Let X — {a?6} be an alphabet and let X* be the free monoid generated by X. Let 1 be the empty word and let X+ — X* \ {1}. The length of a word u is denoted by lg(w). Every subset of X* is called a language. For two words u, v E X + ? we consider the following type of Fibonacci sequence of words:

Recognizing Shuffled Languages

Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can...

All hands on deck!